﻿

# prove a theorem

demostrar un teorema

English-Spanish mathematics dictionary. . 1964.

### Mira otros diccionarios:

• Theorem — The Pythagorean theorem has at least 370 known proofs[1] In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements …   Wikipedia

• prove — verb (proved; proved or proven; proving) Etymology: Middle English, from Anglo French prover, pruver, from Latin probare to test, prove, from probus good, honest, from pro for, in favor + bus (akin to Old English bēon to be) more at pro , be Date …   New Collegiate Dictionary

• theorem — n. 1) to deduce, formulate a theorem 2) to prove; test a theorem 3) a binomial theorem * * * [ θɪərəm] formulate a theorem test a theorem a binomial theorem to deduce to prove …   Combinatory dictionary

• theorem — theo|rem [ˈθıərəm US ˈθi:ə ] n [Date: 1500 1600; : Late Latin; Origin: theorema, from Greek, from theorein; THEORY] technical a statement, especially in mathematics, that you can prove by showing that it has been correctly developed from facts …   Dictionary of contemporary English

• theorem — noun (C) technical a statement, especially in mathematics, that you can prove by reasoning theoretical, also theo.ret.ic adjective 1 concerned with the study of scientific ideas rather than with practical uses of science or practical experience:… …   Longman dictionary of contemporary English

• Original proof of Gödel's completeness theorem — The proof of Gödel s completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a rewritten version of the dissertation, published as an article in 1930) is not easy to read today; it uses concepts and formalism that are… …   Wikipedia

• Four color theorem — Example of a four colored map A four colori …   Wikipedia

• Fermat's Last Theorem — is the name of the statement in number theory that:: It is impossible to separate any power higher than the second into two like powers,or, more precisely:: If an integer n is greater than 2, then the equation a^n + b^n = c^n has no solutions in… …   Wikipedia

• Ramsey's theorem — This article goes into technical details quite quickly. For a slightly gentler introduction see Ramsey theory. In combinatorics, Ramsey s theorem states that in any colouring of the edges of a sufficiently large complete graph (that is, a simple… …   Wikipedia

• Proofs of Fermat's little theorem — This article collects together a variety of proofs of Fermat s little theorem, which states that:a^p equiv a pmod p ,!for every prime number p and every integer a (see modular arithmetic). Simplifications Some of the proofs of Fermat s little… …   Wikipedia

• Kakutani fixed point theorem — In mathematical analysis, the Kakutani fixed point theorem is a fixed point theorem for set valued functions. It provides sufficient conditions for a set valued function defined on a convex, compact subset of a Euclidean space to have a fixed… …   Wikipedia